Title Scale Free Interval Graphs
نویسندگان
چکیده
Scale free graphs have attracted attention by their non-uniform structure that can be used as a model for various social and physical networks. In this paper, we propose a natural and simple random model for generating scale free interval graphs. The model generates a set of intervals randomly under a certain distribution, which defines a random interval graph. The main advantage of the model is its simpleness. The structure/properties of the generated graphs are analyzable by relatively simple probabilistic and/or combinatorial arguments, which is different from many other models. Based on such arguments, we show for our random interval graph that its degree distribution follows the power law, and that it has a large average cluster coefficient.
منابع مشابه
Subexponential Interval Graphs Generated by Immigration-death Processes Subexponential Interval Graphs Generated by Immigration-death Processes
Scale-free graphs have recently attracted much attention since so-called scale-free phenomena have really appeared in various physical and social networks, where a graph is said to be scale-free if the distribution of degrees has a power-law tail. In the previous paper, the authors proposed a simple model of random interval graphs generated by immigration-death processes (also known as M/G/∞ qu...
متن کاملMathematical and Computing Sciences
Scale free graphs have attracted attention by their non-uniform structure that can be used as a model for various social and physical networks. In this paper, we propose two natural and simple random models for generating scale free interval graphs. These models generate a set of intervals randomly, which defines a random interval graph. The main advantage of those models are its simpleness. Th...
متن کاملLinear Orderings of Subfamilies of AT-Free Graphs
Asteroidal triple free (AT-free) graphs have been introduced as a generalization of interval graphs, since interval graphs are exactly the chordal AT-free graphs. While for interval graphs it is obvious that there is always a linear ordering of the vertices, such that for each triple of independent vertices the middle one intercepts any path between the remaining vertices of the triple, it is n...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملInterval minors of complete bipartite graphs
Interval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley-Wilf limits. We investigate the maximum number of edges in Kr,s-interval minor free bipartite graphs. We determine exact values when r = 2 and describe the extremal graphs. For r = 3, lower and upper bounds are given and the structure of K3,s-interval minor free graphs is studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012